Algebraic Block Red-Black Ordering Method for Parallelized ICCG Solver With Fast Convergence and Low Communication Costs
نویسندگان
چکیده
This paper proposes a new parallelized incomplete Cholesky conjugate gradient (ICCG) solver effective on a smallscale multiprocessor system. The new method is based on a new reordering technique, namely the block red-black ordering method. Its parallel performance is evaluated in a finite edge-element eddycurrent analysis. A numerical test shows that the proposed method is effective on a small number of processors due to fast convergence and low communication costs.
منابع مشابه
Algebraic Multicolor Ordering for Parallelized ICCG Solver in Finite-Element Analyses
This paper proposes a new black-box-type parallel processing method for the incomplete Cholesky conjugate gradient (ICCG) solver. The new method is based on a multicolor ordering concept and an automatic reordering process in the solver. Parallel performance is evaluated in the context of three-dimensional finite edge-element eddy-current analysis. The proposed method attains high parallelism w...
متن کاملAnalysis of a new Red-Black Ordering for Gauss-Seidel Smoothing in Cell-Centred Multigrid
Based on numerical experiments with a cell-centred multigrid Poisson solver in one and two dimensions, we propose to use Alternating Coarse-Line Zebra ordering as a robust parallel smoother for the 2D case. The algorithm is presented based on a heuristic discussion, and the convergence rates obtained with diierent smoothers are compared. Local mode analysis is used to estimate the smoothing fac...
متن کاملPreconditioning with a Decoupled Rowwise Ordering on the CM-5
Decoupled rowwise ordering is an ordering scheme for 2-dimensional grids, which is tailored for preconditioning 5-point diierence equations arising from discretizations of partial diierential equations. This paper describes the ordering scheme and implementations of a conjugate gradient solver and SSOR preconditioners which use the decoupled rowwise and the red black ordering schemes on the CM-...
متن کاملWaveform Relaxation with Fast Direct Methods as Preconditioner
For a restricted class of parabolic PDEs one can devise a practical numerical solver with a parallel complexity that is theoretically optimal. The method uses a multidimensional FFT to decouple the unknowns in the spatial domain into independent scalar ODEs. These are discretized to give recurrence relations in the time dimension solved by parallel cyclic reduction. This is the FFT/CR algorithm...
متن کاملParallel SOR Iterative Algorithms and Performance Evaluation on a Linux Cluster
The successive over-relaxation (SOR) how to quickly verify and generate a iterative method is an important solver for linear multicoloring ordering according to the given systems. In this paper, a parallel algorithm for the structure of a matrix or a grid. However, the red-black SOR method with domain decomposition is multi-color SOR method is parallel only within investigated. The parallel SOR...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016